Maximal Equilateral Sets
نویسندگان
چکیده
A subset of a normed space X is called equilateral if the distance between any two points is the same. Let m(X) be the smallest possible size of an equilateral subset of X maximal with respect to inclusion. We first observe that Petty’s construction of a d-dimensional X of any finite dimension d ≥ 4 with m(X) = 4 can be generalised to show that m(X⊕1 R) = 4 for any X of dimension at least 2 which has a smooth point on its unit sphere. By a construction involving Hadamard matrices we then show that both m(lp) and m(lp) are finite and bounded above by a function of p, for all 1 ≤ p < 2. Also, for all p ∈ [1,∞) and d ∈ N there exists c = c(p, d) > 1 such that m(X) ≤ d+ 1 for all d-dimensional X with Banach-Mazur distance less than c from lp. Using Brouwer’s fixed-point theorem we show that m(X) ≤ d + 1 for all d-dimensional X with Banach-Mazur distance less than 3/2 from l∞. A graph-theoretical argument furthermore shows that m(l∞) = d+ 1. The above results lead us to conjecture that m(X) ≤ 1+ dimX.
منابع مشابه
Some results on maximal open sets
In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.
متن کاملAsymptotic bounds on the equilateral dimension of hypercubes
A subset of the finite dimensional hypercube is said to be equilateral if the distance of any two distinct points equals a fixed value. The equilateral dimension of the hypercube is defined as the maximal size of its equilateral subsets. We study asymptotic bounds on the latter quantity considered as a function of two variables, namely dimension and distance. lorenz minder, thomas sauerwald and...
متن کاملQuantization for uniform distributions on equilateral triangles
We approximate the uniform measure on an equilateral triangle by a measure supported on n points. We find the optimal sets of points (n-means) and corresponding approximation (quantization) error for n ≤ 4, give numerical optimization results for n ≤ 21, and a bound on the quantization error for n → ∞. The equilateral triangle has particularly efficient quantizations due to its connection with ...
متن کاملAn Isodiametric Problem for Equilateral Polygons
The maximal perimeter of an equilateral convex polygon with unit diameter and n = 2m edges is not known when m ≥ 4. Using experimental methods, we construct improved polygons for m ≥ 4, and prove that the perimeters we obtain cannot be improved for large n by more than c/n4, for a particular constant c.
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 50 شماره
صفحات -
تاریخ انتشار 2013